def helper(n,mat):
if mat[0][0] == mat[-1][-1]:
return 1
if mat[0][-1] == mat[-1][0]:
return 1
ele1, ele2 = mat[0][0], mat[-1][0]
if ele1 == ele2:
flag = 0
for i in range(n):
if mat[i][-1] == ele1:
flag = 1
break
if flag:
return 1
ele1, ele2 = mat[0][-1], mat[-1][-1]
if ele1 == ele2:
flag = 0
for i in range(n):
if mat[i][0] == ele1:
flag = 1
break
if flag:
return 1
return 0
for _ in range(int(input())):
n,m = map(int,input().split())
mat,tmat = [],[]
for i in range(n):
x = input()
mat.append(x)
for i in range(m):
r = []
for j in range(n):
r.append(mat[j][i])
tmat.append(r)
if n == 1:
if mat[0][0] == mat[0][-1]:
print("YES")
else:
print("NO")
continue
if m == 1:
if mat[0][0] == mat[-1][0]:
print("YES")
else:
print("NO")
continue
if helper(n,mat) or helper(m,tmat):
print("YES")
else:
print("NO")
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |
46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |